best route algorithm

алгоритм выбора наилучшего маршрута


Англо-русский словарь по робототехнике. 2013.

Смотреть что такое "best route algorithm" в других словарях:

  • Diffusing update algorithm — DUAL, the Diffusing Update ALgorithm, is the algorithm used by Cisco s EIGRP routing protocol to ensure that a given route is recalculated globally whenever it might cause a routing loop. According to Cisco, the full name of the algorithm is DUAL …   Wikipedia

  • Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance …   Wikipedia

  • distance vector algorithm —    A family of routing algorithms that calculate the bestpath route to use for data transmission from information present in adjacent nodes on the network. Routing information is broadcast periodically rather than only when a change occurs, which …   Dictionary of networking

  • алгоритм выбора оптимального маршрута — Алгоритм маршрутизации, при котором минимизируется время доставки пакета до конечного адресата. [Л.М. Невдяев. Телекоммуникационные технологии. Англо русский толковый словарь справочник. Под редакцией Ю.М. Горностаева. Москва, 2002] Тематики… …   Справочник технического переводчика

  • Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… …   Wikipedia

  • Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • Hazy Sighted Link State Routing Protocol — The Hazy Sighted Link State Routing Protocol (HSLS) is a wireless mesh network routing protocol being developed by the CUWiN Foundation. This is an algorithm allowing computers communicating via digital radio in a mesh network to forward messages …   Wikipedia

  • Pathfinding — is a term used mostly by computer applications to plot the best route from point A to point B. It is a more realistic variant on solving mazes.Used in a wide variety of games, it refers to AI finding a path around an obstacle, such as a wall,… …   Wikipedia

  • B.A.T.M.A.N. — The Better Approach To Mobile Adhoc Networking, or B.A.T.M.A.N., is a routing protocol which is currently under development by the “Freifunk” Community.B.A.T.M.A.N. s crucial point is the decentralization of the knowledge about the best route… …   Wikipedia

  • Wireless Routing Protocol — The Wireless Routing Protocol (WRP) [Citation last1 = Murthy | first1 = Shree author1 link = last2 = Garcia Luna Aceves | first2 = J. J. author2 link = title = An efficient routing protocol for wireless networks journal = Mobile Networks and… …   Wikipedia

Книги

Другие книги по запросу «best route algorithm» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.